Optimal control of parallel server systems with many servers in heavy traffic
نویسندگان
چکیده
We consider a parallel server system that consists of several customer classes and server pools in parallel. We propose a simple robust control policy to minimize the total linear holding and reneging costs. We show that this policy is asymptotically optimal under the many-server heavy traffic regime for parallel server systems when the service times are only server pool dependent and exponentially distributed.
منابع مشابه
Dynamic Control of N-Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic
We consider a class of parallel server systems that are known as N-systems. In an N-system, there are two customer classes that are catered by servers in two pools. Servers in one of the pools are cross-trained and can serve customers from both classes whereas all the servers in the other pool can only serve one of the customer classes. A customer reneges from his queue if his waiting time in t...
متن کاملDynamic Scheduling of a Parallel Server System in Heavy Traffic with Complete Resource Pooling: Asymptotic Optimality of a Threshold Policy
We consider a parallel server queueing system consisting of a bank of buffers for holding incoming jobs and a bank of flexible servers for processing these jobs. Incoming jobs are classified into one of several different classes (or buffers). Jobs within a class are processed on a first-in-first-out basis, where the processing of a given job may be performed by any server from a given (class-de...
متن کاملScheduling Parallel Servers in the Nondegenerate Slowdown Diffusion Regime: Asymptotic Optimality Results1 by Rami Atar
We consider the problem of minimizing queue-length costs in a system with heterogenous parallel servers, operating in a many-server heavy-traffic regime with nondegenerate slowdown. This regime is distinct from the wellstudied heavy traffic diffusion regimes, namely the (single server) conventional regime and the (many-server) Halfin–Whitt regime. It has the distinguishing property that waiting...
متن کاملScheduling parallel servers in the non - degenerate slowdown diffusion regime : Asymptotic optimality results ∗
We consider the problem of minimizing queue-length costs in a system with heterogenous parallel servers, operating in a many-server heavy-traffic regime with non-degenerate slowdown. This regime is distinct from the well-studied heavy traffic diffusion regimes, namely the (single server) conventional regime and the (many-server) Halfin-Whitt regime. It has the distinguishing property that waiti...
متن کاملDynamic Scheduling for Parallel Server Systems in Heavy Traffic: Graphical Structure, Decoupled Workload Matrix and Some Sufficient Conditions for Solvability of the Brownian Control Problem
We consider a problem of dynamic scheduling for parallel server systems. With the exception of a few special cases, such stochastic control problems cannot be solved exactly. Here we focus on an approach pioneered by J. M. Harrison that utilizes approximating diffusion control problems. This approach has been very successfully used in the special case when the diffusion control problem can be r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 59 شماره
صفحات -
تاریخ انتشار 2008